On the Relations between Incidence Calculus and ATMS
نویسندگان
چکیده
This paper discusses the relationship between incidence cal culus and the ATMS It shows that managing labels for statements in an ATMS is similar to producing the incidence sets of these statements in incidence calculus We will prove that a probabilistic ATMS can be im plemented using incidence calculus In this way we can not only produce labels for all nodes in the system automatically but also calculate the probability of any of such nodes in it The reasoning results in incidence calculus can provide justi cations for an ATMS automatically
منابع مشابه
Constructing probabilistic ATMSs using extended incidence calculus
This paper discusses the relations between extended incidence calculus and the Assumption-based Truth Maintenance Systems (ATMS). We rst prove that managing labels for statements (nodes) in an ATMS is equivalent to producing incidence sets of these statements in extended incidence calculus. We then demonstrate that the justiication set for a node is functionally equivalent to the implication re...
متن کاملAn Analysis of ATMS-Based Techniques for Computing Dempster-Shafer Belief Functions
This paper analyzes the theoretical under pinnings of recent proposals for computing Dempster-Shafer Belief functions from ATMS labels. Such proposals are intended to be a means of integrating symbolic and numeric rep resentation methods and of focusing search in the ATMS. This synthesis is formalized us ing graph theory, thus showing the relation ship between graph theory, the logic-theore...
متن کاملAssumption - Based Reasoning with Algebraic Clauses ∗
Ten years ago, de Kleer introduced assumption-based truth maintenance systems (ATMS) as a powerful tool for different applications in the domain of uncertain reasoning (de Kleer, 1986). A traditional ATMS is based on propositional logic, but it is limited to Horn clauses and to simple queries. An ATMS requires that there is a subset of propositions declared as assumptions. Assumptions are neede...
متن کاملAn Efficient ATMS for Equivalence Relations
We introduce a specialized ATMS for efficiently computing equivalence relations in multiple contexts. This specialized ATMS overcomes the problems with existing solutions to reasoning with equivalence relations. The most direct implementation of an equivalence relation in the ATMS-encoding the reflexive, transitive and symmetric rules in the consumer architectureproduces redundant equality deri...
متن کاملOn Some Equivalence Relations between Incidence Calculus and Dempster-Shafer Theory of Evidence
Incidence Calculus and Dempster-Shafer Theory of Evidence are both theories to describe agents' de grees of belief in propositions, thus being appropri ate to represent uncertainty in reasoning systems. This paper presents a straightforward equivalence proof between some special cases of these theories.
متن کامل